Graph cut - PDFSEARCH.IO - Document Search Engine

Graph cut
Results: 144

#	Item
61	SOS Lecture 2: Max Cut, Sparsest Cut, Small Set Expansion and some relations of Isoperimetry and Hypercontractivity / Boaz Barak Lecture notes by Adrian Vladu and Henry Yuen Suggested reading • As I mentioned in the em Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-10-29 13:20:10 Combinatorial optimization Degree Cut NP-complete problems Combinatorics Randomized algorithm Euclidean algorithm Mathematics Graph theory Theoretical computer science
62	Flows Advanced Algorithms – COMS31900 G = (V, E) is a directed graph with two special vertices s and t, where s is the source and t is the target. We write u → v to denote the directed edge from u to v . Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Combinatorial optimization Maximum flow problem Flow network Ford–Fulkerson algorithm Max-flow min-cut theorem Cut Minimum cut Shortest path problem Network flow Graph theory Mathematics
63	Algorithms for Placing Monitors in a Flow Network (Preliminary Version) Francis Chin1, , Marek Chrobak2, , and Li Yan2, 1 Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2013-09-02 22:22:25 NP-complete problems Graph connectivity Graph Multigraph Bridge Minimum k-cut Line graph Graph coloring Graph theory Mathematics Theoretical computer science
64	Spectral sparsification via random spanners [Extended Abstract] ∗ Michael Kapralov Stanford iCME Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Combinatorial optimization Connectivity Minimum cut Cut Bridge Randomized algorithm Graph theory Graph connectivity Mathematics
65	Unique Games on the Hypercube Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2015-02-07 14:10:22 NP-complete problems Combinatorial optimization Linear programming Operations research Real algebraic geometry Semidefinite programming Maximum cut Vertex cover Hypercube graph Theoretical computer science Graph theory Mathematics
66	Trust-based recommendation systems: an axiomatic approach Reid Andersen∗ Abraham Flaxman∗ Christian Borgs∗ Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2008-01-13 21:45:10 Combinatorics Flow network Operations research Connectivity Directed acyclic graph Minimum cut Axiom Network theory Networks Graph theory Network flow Mathematics
67	Fast Normalized Cut with Linear Constraints Linli Xu Wenye Li Dale Schuurmans Department of Computing Science University of Alberta Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2009-04-06 23:13:13 Matrix theory Mathematical optimization NP-complete problems Operations research Eigenvalues and eigenvectors Spectral clustering Graph partition Eigendecomposition of a matrix Segmentation Algebra Mathematics Linear algebra
68	‘Heirloom’ Table Decoration Recipe FacebookLine the tea-light holder with the lace and, having roughly cut it to shape, press in the f lorists Add to Reading List Source URL: www.thehandcraftedcardcompany.co.uk Language: English - Date: 2013-05-29 08:19:15 Combinatorial optimization Cut Graph connectivity
69	Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov∗ Sanjeev Khanna† Madhu Sudan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Combinatorial optimization NP-complete problems Matroid theory Matching Graph coloring Cut Maximum cut Pseudoforest Minor Graph theory Mathematics Theoretical computer science
70	Multicommodity Flow, Well-linked Terminals, and Routing Problems Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2011-04-25 01:32:00 Maximum flow problem Flow network Planar graph Cut Graph theory Network flow Combinatorial optimization

UPDATE